NA - 90 - 06 * . . The Nonsymmetric Lanczos Algorithm May 1990 and Controllability
نویسندگان
چکیده
We give a brief description of a non-symmetric Lanczos algorithm that does not require strict bi-orthogonality among the generated vectors. We show how the vectors generated are algebraically related to “Controllable Space” and “Observable Space” for a related linear dynamical system. The algorithm described is particularly appropriate for large sparse systems. 1. Intr~uction The Lanczos Algorithm was originally proposed by Lanczos [15] as a method for the computation of eigenvalues of symmetric and nonsymmetric matrices. The idea was to reduce a general matrix to tridiagonal form, from which the eigenvalues could be easily determined, For symmetric matrices, the Lanczos Algorithm has been studied extensively [5] [17]. In that case, the convergence of the algorithm, when used to compute eigenvalues, has been extensively analyzed in [ 141 [ 161 [20] [21] [22, p27OffJ. This algorithm is particularly suited for large sparse matrix problems. A block Lanczos analog has been studied and analyzed by Underwood (cf. Golub and Underwood [lo], Cullum and Willoughby [S] and Parlett [17]). However, until recently, the nonsymmetric Lanczos Algorithm has received much less attention. Some recent computational exprience with this algorithm can be found in [4]. Besides some numerical stability problems, the method suffered from the possibility of an incurable breakdown from which the only way to “recover” was to restart the whole process from the beginning with different starting vectors [22, p388ffJ. More recently, several modifications allowing the Lanczos process . ‘Computer Science Dept., University of Minnesota, Mimeapolis, MN 55455. E-mail: [email protected]. The research reported by this author was supported in part by NSF grant CCR-8813493. 2Computer Science Dept., Stanford University, Stanford, CA 94305. E-mail: [email protected]. The research reported by this author was supporkd in part by AR0 grant DAAU)3-90-G-0105 and in part by NSF grant DCR-8412314.”
منابع مشابه
The Lanczos Algorithm and Hankel Matrix Factorization
In 1950 Lanczos [22] proposed a method for computing the eigenvalues of symmetric and nonsymmetric matrices. The idea was to reduce the given matrix to a tridiagonal form, from which the eigenvalues could be determined. A characterization of the breakdowns in the Lanczos algorithm in terms of algebraic conditions of controllability and observability was addressed in [6] and [26]. Hankel matrice...
متن کاملRecent Advances in Lanczos-Based Iterative Methods for Nonsymmetric Linear Systems
In recent years, there has been a true revival of the nonsymmetric Lanczos method. On the one hand, the possible breakdowns in the classical algorithm are now better understood, and so-called look-ahead variants of the Lanczos process have been developed, which remedy this problem. On the other hand, various new Lanczos-based iterative schemes for solving nonsymmetric linear systems have been p...
متن کاملError Analysis of the Lanczos Algorithm for the Nonsymmetric Eigenvalue Problem
This paper presents an error analysis of the Lanczos algorithm in finite-precision arithmetic for solving the standard nonsymmetric eigenvalue problem, if no breakdown occurs. An analog of Paige's theory on the relationship between the loss of orthogonality among the Lanczos vectors and the convergence of Ritz values in the symmetric Lanczos algorithm is discussed. The theory developed illustra...
متن کاملThe Unsymmetric Lanczos Algorithms and Their Relations to Pad E Approximation Continued Fractions and the Qd Algorithm
First several algorithms based on the unsymmetric Lanczos process are surveyed the biorthog onalization BO algorithm for constructing a tridiagonal matrix T similar to a given matrix A whose ex treme spectrum is sought typically the BOBC algorithm which generates directly the LU factors of T the Biores Lanczos Orthores Biomin Lanczos Orthomin or biconjugate gradient BCG and the Biodir Lanczos O...
متن کاملA Convergence Analysis for Nonsymmetric Lanczos Algorithms
A convergence analysis for the nonsymmetric Lanczos algorithm is presented. By using a tridiagonal structure of the algorithm, some identities concerning Ritz values and Ritz vectors are established and used to derive approximation bounds. In particular, the analysis implies the classical results for the symmetric Lanczos algorithm.
متن کامل